Multi-ary Α-semantic Resolution Automated Reasoning Based on a Lattice-valued Proposition Logic Lp(x)
نویسندگان
چکیده
This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the soundness and completeness are gotten. An algorithm of multi-ary α-semantic resolution method is constructed; the soundness and completeness of multi-ary α-semantic resolution algorithm are also obtained. This work will provide a theoretical foundation for the more efficient resolution based automated reasoning in lattice-valued logic.
منابع مشابه
Determination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...
متن کاملDetermination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra
As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...
متن کاملα-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...
متن کاملα-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملLinguistic Truth-value Lattice-valued Logic System with Important Coefficient and Its Application to Evaluation System
In this paper, a linguistic truth-value lattice proposition logic system LTV LP (X) is presented firstly. It is an useful and reasonable tool to deal with the linguistic term set including linear ordered set and non-linear ordered set. Then an operator linguistic truth-value lattice-valued proposition logic OLTV LP (X) is given. The OLTV LP (X) can provide a theoretical model for multi-evaluato...
متن کامل